An Overview of the RAPID Run-time System for Parallel Irregular Computations
نویسندگان
چکیده
RAPID is a run-time system that uses an inspector/executor approach to parallelize irregular computations by embodying graph scheduling techniques to optimize interleaved communication and computation with mixed granularities. It provides a set of library functions for specifying irregular data objects and tasks that access these objects, extracts a task dependence graph from data access patterns, and executes tasks efficiently on a distributed memory machine. In this report, we give an overview of this system and discuss its preliminary performance result on Meiko CS-2 with sparse matrix factorizations.
منابع مشابه
Parallel computing using MPI and OpenMP on self-configured platform, UMZHPC.
Parallel computing is a topic of interest for a broad scientific community since it facilitates many time-consuming algorithms in different application domains.In this paper, we introduce a novel platform for parallel computing by using MPI and OpenMP programming languages based on set of networked PCs. UMZHPC is a free Linux-based parallel computing infrastructure that has been developed to cr...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملDynamic Data Distribution and Processor Repartitioning for Irregularly Structured Computations
Irregular applications comprise a significant and increasing portion of jobs running in parallel environments. Recent research has shown that, in parallel environments, both the system utilization and application turn around time improve when resources allocated to applications can be dynamically adjusted at run-time, depending on the workload. To realize this, at least some of the parallel app...
متن کاملAutomatic Parallelization of the AVL FIRE Benchmark for a Distributed-Memory System
Computational uid dynamics (CFD) is a Grand Challenge discipline whose typical application areas, like aerospace and automotive engineering, often require enormous amount of computations. Parallel processing ooers very high performance potential, but irregular problems like CFD have proven diicult to map onto parallel machines. In such codes, access patterns to major data arrays are dependent o...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007